An Efficient Load Balancing Algorithm on Distributed Networks

In order to maintain load balancing in a distributed system, we should obtain workload information from all the nodes on the network. This processing requires O(v) communication complexity, where v is the number of nodes. In this paper, we present a new synchronous dynamic distributed load balancing algorithm based on (v, k + 1, 1) design, where v = k + k + 1. Our algorithm needs only O(v √ v) communication complexity and each node receives workload information from all the nodes without redundancy. And load balancing is maintained so that every node has the same amount of traffic for transferring workload information.